Algorithm Theory , Winter Term 2015 / 16 Problem Set 11 - Sample Solution Exercise 1 : ( 7 points )
نویسنده
چکیده
Assume that we are given a rooted tree with n leaves. All leaves have the same distance ` from the root and all nodes except for the leaves have three children. A problem instance consists of such a tree and a boolean value for each leaf. The value of each inner node is defined as the majority value of its children. Initially, the values of inner nodes are not given. The objective is to compute the value of the root. The performance of an algorithm to solve this problem is measured by the number of leaves whose values are read by the algorithm.
منابع مشابه
Algorithm Theory , Winter Term 2015 / 16 Problem Set 9 - Sample Solution Exercise 1 : Maximum Matching ( 6 points )
We are given a bipartite graph B = (U ∪̇V, E) on two disjoint node sets U and V ; each edge connects a node in U to a node in V . In the following, we define a 2-claw to be a set of three distinct nodes {u, x, y} such that u ∈ U , x, y ∈ V and there is an edge from u to both nodes x and y. We consider the following maximization problem on the graph B: Find a largest possible set of vertexdisjoin...
متن کاملStrong convergence of variational inequality problem Over the set of common fixed points of a family of demi-contractive mappings
In this paper, by using the viscosity iterative method and the hybrid steepest-descent method, we present a new algorithm for solving the variational inequality problem. The sequence generated by this algorithm is strong convergence to a common element of the set of common zero points of a finite family of inverse strongly monotone operators and the set of common fixed points of a finite family...
متن کاملAlgorithm Theory , Winter Term 2015 / 16 Problem Set 13 - Sample Solution Exercise 1 : LRU with Potential Function ( 5 points )
When studying online algorithm, the total (average) cost for serving a sequence of requests can often be analyzed using amortized analysis. In the following, we will apply this to the paging problem and you will analyze the competitive ratio of the LRU algorithm by using a potential function. Recall that a potential function assigns a non-negative real value to each system state. In the context...
متن کاملAdaptive Unstructured Grid Generation Scheme for Solution of the Heat Equation
An adaptive unstructured grid generation scheme is introduced to use finite volume (FV) and finite element (FE) formulation to solve the heat equation with singular boundary conditions. Regular grids could not acheive accurate solution to this problem. The grid generation scheme uses an optimal time complexity frontal method for the automatic generation and delaunay triangulation of the grid po...
متن کاملAn Iterative Scheme for Generalized Equilibrium, Variational Inequality and Fixed Point Problems Based on the Extragradient Method
The problem ofgeneralized equilibrium problem is very general in the different subjects .Optimization problems, variational inequalities, Nash equilibrium problem and minimax problems are as special cases of generalized equilibrium problem. The purpose of this paper is to investigate the problem of approximating a common element of the set of generalized equilibrium problem, variational inequal...
متن کامل